On password-based authenticated key exchange using collisionful hash functions
نویسندگان
چکیده
This paper presents an attack on Anderson and Lomas's proposed password-based authenticated key exchange protocol that uses col-lisionful hash functions. The weaknesses of the protocol when an old session key is compromised are studied and alternative solutions are given.
منابع مشابه
A New Ring-Based SPHF and PAKE Protocol On Ideal Lattices
emph{ Smooth Projective Hash Functions } ( SPHFs ) as a specific pattern of zero knowledge proof system are fundamental tools to build many efficient cryptographic schemes and protocols. As an application of SPHFs, emph { Password - Based Authenticated Key Exchange } ( PAKE ) protocol is well-studied area in the last few years. In 2009, Katz and Vaikuntanathan described the first lattice-based ...
متن کاملDistributed Smooth Projective Hashing and its Application to Two-Server PAKE
Smooth projective hash functions have been used as building block for various cryptographic applications, in particular for password-based authentication. In this work we propose the extended concept of distributed smooth projective hash functions where the computation of the hash value is distributed across n parties and show how to instantiate the underlying approach for languages consisting ...
متن کاملon Mathematical and Computing Sciences Department
This paper continues the study of password-based protocols for authenticated key exchange (AKE). In 2000, Bellare, Pointcheval, and Rogaway [2] proposed the formal model on AKE. In this paper, we propose the new security notions on AKE, based on the non-malleability of session keys. Then we prove that this security notion is equivalent to that proposed in [2]. Furthermore, we show that there is...
متن کاملTrapdoor Smooth Projective Hash Functions
Katz and Vaikuntanathan recently improved smooth projective hash functions in order to build oneround password-authenticated key exchange protocols (PAKE). To achieve security in the UC framework they allowed the simulator to extract the hashing key, which required simulation-sound non-interactive zero-knowledge proofs that are unfortunately ine cient. We improve the way the latter extractabili...
متن کاملSmooth Projective Hashing for Conditionally Extractable Commitments
The notion of smooth projective hash functions was proposed by Cramer and Shoup and can be seen as special type of zero-knowledge proof system for a language. Though originally used as a means to build efficient chosen-ciphertext secure public-key encryption schemes, some variations of the Cramer-Shoup smooth projective hash functions also found applications in several other contexts, such as p...
متن کامل